Scheduling trainees at a hospital department using a branch-and-price approach.

Scheduling trainees (graduate students) is a complicated problem that has to be solved frequently in many hospital departments. We will describe a trainee scheduling problem encountered in practice (at the ophthalmology department of the university hospital Gasthuisberg, Leuven). In this problem a department has a certain number of trainees at its disposal, which assist specialists in their activities (surgery, consultation, etc.). For each trainee one has to schedule the activities in which (s)he will assist during a certain time horizon, usually one year. Typically, these kind of scheduling problems are characterized by both hard and soft constraints. The hard constraints consist of both work covering constraints and formation requirements, whereas the soft constraints include trainees' preferences and setup restrictions. In this paper we will describe an exact branch-and-price method to solve the problem to optimality.Branch-and-price; Constraint; Health care; Problems; Requirements; Scheduling; Staff scheduling; Time; University;

Heuristic branch-and-price for building long term trainee schedules.

Branch-and-price is an increasingly important technique for solving large integer programming models. Staff scheduling has been a particularly fruitful area since these problems typically exhibit a decomposable structure. Beside computational efficiency branch-and-price produces two other important advantages in comparison with pure integer programming. Firstly, it often allows for a more accurate problem statement since many constraints which are hard to formulate in the integer program could be easily incorporated in the column generator. Secondly, a branch-and-price algorithm can easily be turned into an effective heuristic when optimality is no major concern. We illustrate these advantages for a medical trainee scheduling problem encountered at Oogziekenhuis Gasthuisberg Leuven and present some computational results together with implementation issues.Advantages; Area; Branch-and-price; Constraint; Efficiency; Heuristic; Integer programming; Model; Models; Problems; Research; Scheduling; Staff scheduling; Structure;

On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem.

In this paper a comparison is made between two decomposition techniques to solve a staff scheduling problem with column generation. In the first approach, decomposition takes place on the staff members, whereas in the second approach decomposition takes place on the activities that have to be performed by the staff members. The resulting master LP is respectively a set partitioning problem and a capacitated multi-commodity flow problem. Both approaches have been implemented in a branch-and-price algorithm. We show a trade-off between modeling power and computation times of both techniques.decomposition; staff scheduling; set partitioning; multi-commodity flow; branch-and-price; branch-and-price; programs;

Integrating nurse and surgery scheduling.

Scheduling; Surgery scheduling; International; Theory; Applications; Euro; Researchers;

Integer programming for building robust surgery schedules.

This paper proposes and evaluates a number of models for building robust cyclic surgery schedules. The developed models involve two types of constraints. Demand constraints ensure that each surgeon (or surgical group) obtains a specific number of operating room (OR) blocks. Capacity con- straints limit the available OR blocks on each day. Furthermore, the number of operated patients per block and the length of stay (LOS) of each operated patient are dependent on the type of surgery. Both are considered stochas- tic, following a multinomial distribution. We develop a number of MIP-based heuristics and a metaheuristic to minimize the expected total bed shortage and present computational results.Constraint; Demand; Distribution; Expected; Heuristic; Integer programming; Model; Models; Resource leveling; Surgery scheduling;

Supply chain management of blood products: a literature review.

This paper presents a review of the literature on inventory and supply chain management of blood products. First, we identify different perspectives on approaches to classifying the existing material. Each perspective is presented as a table in which the classification is displayed. The classification choices are exemplified through the citation of key references or by expounding the features of the perspective. The main contribution of this review is to facilitate the tracing of published work in relevant fields of interest, as well as identifying trends and indicating which areas should be subject to future research.OR in health services; Supply chain management; Inventory; Blood products; Literature review;

Improving workforce scheduling of aircraft line maintenance at Sabena Technics.

This paper presents our application of a visualization tool and optimization model based on mixed-integer linear programming to solve a workforce staffing and scheduling problem at Sabena Technics, a major aircraft maintenance company in Belgium. We used the software to generate many alternative, cost-efficient schedules and to analyze multiple scenarios. In several management meetings, takeholders evaluated the schedules and raised concerns. We subsequently changed the model to successfully address their concerns. The model has resulted in considerable savings and a more efficient use of human resources.Workforce staffing; Scheduling; Optimization; Visualization; Aircraft maintenance;

Operating room planning and scheduling: A literature review.

This paper provides a review of recent research on operating room planning and scheduling. We evaluate the literature on multiple fields that are related to either the problem setting (e.g. performance measures or patient classes) or the technical features (e.g. solution technique or uncertainty incorporation). Since papers are pooled and evaluated in various ways, a diversified and detailed overview is obtained that facilitates the identification of manuscripts related to the reader's specific interests. Throughout the literature review, we summarize the significant trends in research on operating room planning and scheduling and we identify areas that need to be addressed in the future.Health care; Operating room; Scheduling; Planning; Literature review;

Optimizing a multiple objective surgical case scheduling problem.

The scheduling of the operating theater on a daily base is a complicated task and is mainly based on the experience of the human planner. This, however, does not mean that this task can be seen as unimportant since the schedule of individual surgeries influences a medical department as a whole. Based on practical suggestions of the planner and on real-life constraints, we will formulate a multiple objective optimization model in order to facilitate this decision process. We will show that this optimization problem is NP-hard and hence hard to solve. Both exact and heuristic algorithms, based on integer programming and on implicit enumeration (branch-and-bound), will be introduced. These solution approaches will be thoroughly tested on a realistic test set using data of the surgical day-care center at the university hospital Gasthuisberg in Leuven (Belgium). Finally, results will be analyzed and conclusions will be formulated.Algorithms; Belgium; Branch-and-bound; Constraint; Data; Decision; Experience; Healthcare; Heuristic; Integer; Integer programming; Model; Optimization; Order; Processes; Real life; Scheduling; University;

Scheduling surgical cases in a day-care environment: a branch-and-price approach.

In this paper we will investigate how to sequence surgical cases in a day-care facility so that multiple objectives are simultaneously optimized. The limited availability of resources and the occurrence of medical precautions, such as an additional cleaning of the operating room after the surgery of an infected patient, are taken into account. A branch-and-price methodology will be introduced in order to develop both exact and heuristic algorithms. In this methodology, column generation is used to optimize the linear programming formulation of the scheduling problem. Both a dynamic programming approach and an integer programming approach will be specified in order to solve the pricing problem. The column generation procedure will be combined with various branching schemes in order to guarantee the integrality of the solutions. The resulting solution procedures will be thoroughly tested and evaluated using real-life data of the surgical day-care center at the university hospital Gasthuisberg in Leuven (Belgium). Computational results will be summarized and conclusions will eventually be formulated.Branch-and-price; Column generation; Health care operations; Scheduling;